A New Coding Algorithm for Trees
نویسنده
چکیده
We construct a one-to-one mapping between binary vectors of length n and preorder codewords of regular, ordered, oriented, rooted, binary trees having N ≈ n+2 log n nodes. The mappings in both directions can be organized in such a way that complexities of all transformations are measured by linear functions of n. The approach is then completely extended to non-regular binary trees and partially extended to D-ary trees with D > 2.
منابع مشابه
A New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملA New Algorithm for Optimization of Fuzzy Decision Tree in Data Mining
Decision-tree algorithms provide one of the most popular methodologies for symbolic knowledge acquisition. The resulting knowledge, a symbolic decision tree along with a simple inference mechanism, has been praised for comprehensibility. The most comprehensible decision trees have been designed for perfect symbolic data. Classical crisp decision trees (DT) are widely applied to classification t...
متن کاملParallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کاملA New, Fast, and Efficient Image Codec Based on Set Partitioning in Hierarchical Trees - Circuits and Systems for Video Technology, IEEE Transactions on
AlbstructEmbedded zerotree wavelet (EZW) coding, introduced by J. M. Shapiro, is a very effective and computationally simple technique for image compression. Here we offer an alternative explanation of the principles of its operation, so that the reasons for its excellent performance can be better understood. Theise principle9 are partial ordering by magnitude with a set parlitioning sorting al...
متن کاملA New Hybrid Parallel Simulated Annealing Algorithm for Travelling Salesman Problem with Multiple Transporters
In today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. In this paper, we present a new model for the traveling salesman problem with multiple transporters (TSPMT). In the proposed model, which is more applicable than the traditional versions, each city has diffe...
متن کاملA New Fast and E cient Image Codec Based on Set Partitioning in Hierarchical Trees
Embedded zerotree wavelet (EZW) coding, introduced by J. M. Shapiro, is a very e ective and computationally simple technique for image compression. Here we o er an alternative explanation of the principles of its operation, so that the reasons for its excellent performance can be better understood. These principles are partial ordering by magnitude with a set partitioning sorting algorithm, ord...
متن کامل